#include <algorithm>
#include <vector>

#include <iostream>

int main() {
    int n, m;

    std::cin >> n >> m;

    while (n != 0 || m != 0) {

        int cost = 0;

        std::vector<int> heads;
        heads.reserve(n);

        for (int i = 0; i < n; ++i) {
            int val;
            std::cin >> val;
            heads.emplace_back(val);
        }

        std::vector<int> knights;
        knights.reserve(m);

        for (int i = 0; i < m; ++i) {
            int val;
            std::cin >> val;
            knights.emplace_back(val);
        }

        std::sort(heads.begin(), heads.end());
        std::sort(knights.begin(), knights.end());

        auto i = heads.begin();
        auto j = knights.begin();

        auto cost_of_ = [](int capability) { return capability; };

        while (i != heads.end() && j != knights.end()) {
            if (*j >= *i) {
                cost += cost_of_(*j);
                ++i;
                ++j;
            } else {
                ++j;
            }
        }

        if (i != heads.end()) {
            std::cout << "Loowater is doomed!\n";
        } else {
            std::cout << cost << "\n";
        }

        std::cin >> n >> m;
    }
}
